Representing Unish Grammars Based on Tree Adjoining Grammar Formalisms

Tree Adjoining Grammar and Related Formalisms

In this paper we discuss the use of intersection as a tool for modeling syntactic phenomena and folding of biological molecules. We argue that intersection is useful but easily overestimated, because intersection coordinates grammars via their string languages, and if strong generative capacity is given priority over weak generative capacity, this kind of coordination turns out to be rather lim...

Book Reviews Tree Adjoining Grammars: Formalisms, Linguistic Analysis and Processing

Take a finite set T of trees, and close it under the operation of substitution—replacing daughterless nonterminals by other trees in T whose root node label matches the nonterminal. The set of all terminal strings of trees in the resultant tree-set will be a context-free language (CFL), and for every CFL there will be such a finite set of trees that generates it under substitution. For an elega...

Unification-Based Tree Adjoining Grammars

Many current grammar formalisms used in computational linguistics take a unification-based approach that use structures (called feature structures) containing sets of feature-value pairs. In this paper, we describe a unification-based approach to Tree Adjoining Grammars (TAG). The resulting formalism (UTAG) retains the principle of factoring dependencies and recursion that is fundamental to TAG...

Synchronous Tree-Adjoining Grammars

The unique properties of tree-adjoining grammars (TAG) present a challenge for the application of TAGs beyond the limited confines of syntax, for instance, to the task of semantic interpretation or automatic translation of natural language. We present a variant of TAGs, called synchronous TAGs, which characterize correspondences between languages. The formalism's intended usage is to relate exp...

Tree-Adjoining Grammars